Variable neighborhood search algorithm for the green vehicle routing problem
نویسندگان
چکیده
منابع مشابه
Investigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm
In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...
متن کاملDynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm
In order to effectively solve the dynamic vehicle routing problem with time windows, the mathematical model is established and an improved variable neighborhood search algorithm is proposed. In the algorithm, allocation customers and planning routes for the initial solution are completed by the clustering method. Hybrid operators of insert and exchange are used to achieve the shaking process, t...
متن کاملA Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm
The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...
متن کاملA Novel Heuristic Algorithm Based on Clark and Wright Algorithm for Green Vehicle Routing Problem
A significant portion of Gross Domestic Production (GDP) in any country belongs to the transportation system. Transportation equipment, in the other hand, is supposed to be great consumer of oil products. Many attempts have been assigned to the vehicles to cut down Greenhouse Gas (GHG). In this paper a novel heuristic algorithm based on Clark and Wright Algorithm called Green Clark and Wright (...
متن کاملA HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM
The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Industrial Engineering Computations
سال: 2018
ISSN: 1923-2926,1923-2934
DOI: 10.5267/j.ijiec.2017.6.004